Fisher–Yates shuffle - PDFSEARCH.IO - Document Search Engine

Fisher–Yates shuffle
Results: 42

#	Item
21	Deferred Maintenance of Disk-Based Random Samples Rainer Gemulla and Wolfgang Lehner Dresden University of Technology, 01099 Dresden, Germany {gemulla, lehner}@inf.tu-dresden.de Add to Reading List Source URL: dws.informatik.uni-mannheim.de Language: English - Date: 2014-09-29 11:40:17 Randomness Statistical inference Permutations Probabilistic complexity theory Sample size determination Fisher–Yates shuffle Random sample Reservoir sampling Sample Statistics Sampling Probability and statistics
22	Technical Report UNIVERSITY OF THE BASQUE COUNTRY Department of Computer Science and Artificial Intelligence An R package for permutations, Mallows Add to Reading List Source URL: addi.ehu.es Language: English - Date: 2014-01-22 19:01:02 Random permutation Inversion Fisher–Yates shuffle Cycle Cyclic Stirling numbers of the first kind Permutation pattern Cycle index Mathematics Permutations Permutation
23	Efficiency Considerations in Using Semi-random Sources. (Extended Abstract) Umesh V. Vazirani Harvard University Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2004-09-11 21:09:07 Randomness Finite fields Probabilistic complexity theory Analysis of algorithms Randomized algorithm Fisher–Yates shuffle Pseudorandomness Bounded-error probabilistic polynomial Information theory Theoretical computer science Applied mathematics Mathematics
24	1 Compact and Side Channel Resistant Discrete Gaussian Sampling Sujoy Sinha Roy, Oscar Reparaz, Frederik Vercauteren, and Ingrid Verbauwhede Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-10-01 02:38:22 Probability and statistics Normal distribution Lookup table Random walk Random variable Fisher–Yates shuffle Sampler Probability distribution Hamming weight Statistics Randomness Mathematics
25	Inverting the Viterbi Algorithm: An Abstract Framework for Structure Design Michael Schnall-Levin [removed] Leonid Chindelevitch Add to Reading List Source URL: www.machinelearning.org Language: English - Date: 2008-05-12 14:01:36 Probability and statistics Viterbi algorithm Hidden Markov model Dynamic programming Stochastic context-free grammar Markov chain Fisher–Yates shuffle Baum–Welch algorithm Algorithm Markov models Statistics Mathematics
26	Packing a Knapsack of Unknown Capacity Yann Disser∗ , Max Klimm, Nicole Megow† , and Sebastian Stiller Department of Mathematics, Technische Universität Berlin, Germany {disser,klimm,nmegow,stiller}@math.tu-berlin.d Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2014-06-06 08:08:21 Combinatorial optimization NP-complete problems Permutations Cryptography Knapsack problem Operations research Merkle–Hellman knapsack cryptosystem Fisher–Yates shuffle Universal property Theoretical computer science Mathematics Computational complexity theory
27	PDF Document Add to Reading List Source URL: hal.archives-ouvertes.fr Language: English - Date: 2014-07-03 03:52:14 Algorithm Mathematical logic Fisher–Yates shuffle Mathematics Theoretical computer science Applied mathematics
28	Scalable K-Means++ Bahman Bahmani∗† Benjamin Moseley∗‡ Andrea Vattani∗§ Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2012-02-28 09:44:55 Machine learning K-means clustering K-medians clustering Cluster analysis Fisher–Yates shuffle Data stream clustering Consensus clustering Statistics Computational statistics K-means++
29	A procedural procedural level generator generator Manuel Kerssemakers, Jeppe Tuxen, Julian Togelius and Georgios N. Yannakakis Abstract—Procedural content generation (PCG) is concerned with automatically generating gam Add to Reading List Source URL: julian.togelius.com Language: English - Date: 2013-08-26 11:58:52 Monte Carlo methods Computer programming Procedural generation Random number generation Electronic test equipment Electric generator Generator Fisher–Yates shuffle Gameplay Randomness Mathematics Computing
30	Generating Pseudo-random Floating-Point Values Allen B. Downey July 25, 2007 Abstract The conventional method for generating a pseudorandom floatingpoint value is to generate a pseudorandom integer and divide by a consta Add to Reading List Source URL: allendowney.com Language: English - Date: 2007-07-25 11:05:15 Binary arithmetic Computing Numbers Randomness Floating point Double-precision floating-point format Single-precision floating-point format Fisher–Yates shuffle Pseudorandomness Computer arithmetic Data types Mathematics